Clustering the wireless Ad Hoc networks: A distributed learning automata approach

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Clustering the wireless Ad Hoc networks: A distributed learning automata approach

In ad hoc networks, the performance is significantly degraded as the size of the network grows. The network clustering is a method by which the nodes are hierarchically organized on the basis of the proximity and thus the scalability problem is alleviated. Finding the weakly connected dominating set (WCDS) is a well-known approach, proposed for clustering the wireless ad hoc networks. Finding t...

متن کامل

Distributed Learning Automata-Based Clustering Algorithm in Wireless Ad Hoc Networks

In ad hoc networks, the performance is significantly degraded as the size of the network grows. The network clustering is a method by which the nodes are hierarchically organized on the basis of the proximity and thus the scalability problem is alleviated. Finding the weakly connected dominating set (WCDS) is a well-known approach, proposed for clustering the wireless ad hoc networks. Finding t...

متن کامل

Broadcast Routing in Wireless Ad-Hoc Networks: A Particle Swarm optimization Approach

While routing in multi-hop packet radio networks (static Ad-hoc wireless networks), it is crucial to minimize power consumption since nodes are powered by batteries of limited capacity and it is expensive to recharge the device. This paper studies the problem of broadcast routing in radio networks. Given a network with an identified source node, any broadcast routing is considered as a directed...

متن کامل

An Efficient Distributed Clustering Scheme for Ad-hoc Wireless Networks

In ad-hoc mobile radio networks, nodes are organized into non-overlapping clusters. These clusters are independently controlled and dynamically reconfigured when the topology changes. This work presents a Distributed Label clustering scheme (DL) that partitions nodes into clusters using a weight-based criterion. The DL scheme allows the border nodes to determine their roles first to avoid selec...

متن کامل

Mobility-based multicast routing algorithm for wireless mobile Ad-hoc networks: A learning automata approach

Please cite this article in press as: J. Akbari Tork learning automata approach, Comput. Commun During the last decades, many studies have been conducted on multicast routing in mobile ad hoc networks (MANET) and a host of algorithms have been proposed. In existing algorithms, the mobility characteristics are assumed to be constant, and so they do not scale well when the mobility parameters are...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Parallel and Distributed Computing

سال: 2010

ISSN: 0743-7315

DOI: 10.1016/j.jpdc.2009.10.002